Optimal Virtual Path Routing Control for Survivable ATM Networks

نویسنده

  • K. Sailaja
چکیده

In order to offer a better network survivability, it is crucial that a network manager can realize restorable traffic assignment in response to traffic dynamics and facility network reconfiguration. In this paper, I presented an optimal virtual path routing control for survivable ATM networks to minimize the expected amount of lost flow upon restoration from a network failure. The amount of lost flow is calculated based on the fast restoration algorithm such that it gives an optimal traffic distribution with the minimum service interruption. The fast restoration and optimal flow assignment have two contradicting requirements. In order to accommodate these contradicting requirements, the VP manager uses two-step restoration approach. This paper focuses on the problem of the long-term reconfiguration, which is also used for the network-wide restoration. It has been found through numerical experiments that convergence to a nearoptimum is possible by properly choosing parameters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Branch and Bound Algorithm for a Backup Virtual Path Assignment in Survivable Atm Networks

Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence o...

متن کامل

Visualization of ATM virtual path connection networks

ATM supports multiple quality of service classes for different application requirements. A Quality of Service is associated with a virtual path connection. Dynamic reconfiguration can generate an optimal virtual path connection network and maintains sufficient capacity to carry the established calls in progress. We developed a tool to present information specific to the changes of virtual path ...

متن کامل

Polynomial Time Algorithm (PTA) to generate a survivable ring virtual topology for Optical WDM based on the Hamiltonian Circuit Detection Heuristics(HCDH)

The Routing and Wavelength Assignment (RWA) problem is known to be NP-hard for general Physical Topology (PT) in optical networks. We have analyzed the survivability of the optical network under Survivable Routing and Shared Path Protection (SPP) for various topologies and suggested two survivable RWA algorithms which are shown to perform better under certain performance matrix by simulation. G...

متن کامل

Bounded Flooding Routing Algorithm for Provisioning the Globally Optimal Route in a Hierarchical ATM Network

ATM virtual path (VP) contains bundles of virtual channels (VCs). A VP layer network can be used as a server layer network of VC layer networks and each VC layer network can be a client layer. Therefore the effective provision of VC services can be achieved by a better routing scheme of the VP layer network. However, the traditional hierarchical routing scheme of PNNI signaling protocol does no...

متن کامل

Modeling, Algorithms and Analysis of Survivable VP Planning in ATM Networks∗

In this paper, we consider the working VP and backup VP routing problems jointly and employ the integer programming based approach to maximize the system resource utilization and the network survivability. The VP planning problem is formulated as a nonlinear combinatorial optimization problem. The objective function minimizes the resource usage while maximizing the network survivability. By pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015